Rim Hook

نویسندگان

  • Sergey Fomin
  • Dennis Stanton
چکیده

We consider the partial order on partitions of integers deened by removal of rim hooks of a given length. The isomorphism between this poset and a product of Young's lattices leads to rim hook versions of Schensted correspondences. Analogous results are given for shifted shapes. A shape, or Young diagram, is a nite order ideal of the lattice P 2 = f(k; l) : k; l 1g. Each shape = f(i; j) : 1 j i g can be identiied with the corresponding partition = (1 2 : : :). Shapes form the Young lattice Y (see, e.g., St86]). In drawing the shapes, we use the so-called \English notation;" for example, the partition (5; 3; 1; 1) is represented by the shape : We denote by # the number of boxes in a shape. The i'th diagonal of a shape is the set f(k; l) : l ? k = ig. A rim hook is a contiguous strip of boxes in P 2 , which has at most one box on each diagonal. Throughout the paper a positive integer r is xed, and all the rim hooks contain exactly r boxes, with the exception of Deenition 3.4(3).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalization of the Schensted Algorithm for Rim Hook Tableaux

In [6] Schensted constructed the Schensted algorithm, which gives a bijection between permutations and pairs of standard tableaux of the same shape. Stanton and White [8] gave analog of the Schensted algorithm for rim hook tableaux. In this paper we give a generalization of Stanton and White’s Schensted algorithm for rim hook tableaux. If k is a fixed positive integer, it shows a one-to-one cor...

متن کامل

A Sign-reversing Involution for Rooted Special Rim-hook Tableaux

Eg̃eciog̃lu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define a sign-reversing involution on rooted special rim-hook tableaux which can be used to prove that the last column o...

متن کامل

An algorithmic sign-reversing involution for special rim-hook tableaux

Eğecioğlu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define an algorithmic signreversing involution on rooted special rim-hook tableaux which can be used to prove that the l...

متن کامل

Swiching Rule on the Shifted Rim Hook Tableaux

When the Schur function sλ corresponding to a partition λ is defined as the generating function of the column strict tableaux of shape λ it is not at all obvious that sλ is symmetric. In [BK] Bender and Knuth showed that sλ is symmetric by describing a switching rule for column strict tableaux, which is essentially equivalent to the jeu de taquin of Schützenberger (see [Sü]). Bender and Knuth’s...

متن کامل

Rim Hook Lattices

A partial order is defined on partitions by the removal of rim hooks of a given length. This poset is isomorphic to a product of Young lattices, guaranteeing rim hook versions of Schensted correspondences. Analogous results are given for shifted shapes. 1. Main Results A shape (Young diagram) is a finite order ideal of the lattice P = {(k, l) : k, l ≥ 1}. Shapes form the so-called Young lattice...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998